1087B - Div Times Mod - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
// #define forn(i, n) for (int i = 0; i < int(n); i++)
#define pb push_back
using ll =long long;
long long binconvert(int n) 
{
  long long bin = 0;
  int rem, i = 1;
 
 
  while (n!=0) {
    rem = n % 2;
    n /= 2;
    bin += rem * i;
   
    i *= 10;
  }
 
 
  return bin;
}
int arr[23];
void facto()
{arr[0]=1;
    arr[1]=1;
    arr[2]=2;
     for(int i=3;i<=22;i++)
     {
      arr[i]=arr[i-1]+arr[i-2];
     }
}

int gcd(int a,int b)
{
  if(b==0)
  {
    return a;
  }
  return gcd(b,a%b);
}
int lcsub(string S,char K)
{
   
    int currc = 0, prevc = 0, maxl;
 
    for (int i = 0; i < S.size(); i++) 
    {
 
        if (S[i] == K) {
            currc += 1;
        }
 
        else {
            prevc = max(prevc, currc);
            currc = 0;
        }
    }
 
    prevc = max(prevc, currc);
 
    maxl = prevc;
 
    return maxl;
}

ll sum(string s)
{
    int sum1=0;
    for(auto i:s)
    {
        sum1+=int(i-48);


    }
    return sum1;
}

void solve()
{
   
  ll n,k;
  cin>>n>>k;
  for(int i=k-1;i>0;i--)
  {
    if(n%i==0)
    {
        cout<<i+(n/i)*k;
        return;
    }
  }



}


int main() {
//  freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
 // facto();
	int t=1;
     //cin>>t;
	while(t--)
  {
	
		solve();
	}

}